Ranking from Pairwise Comparisons in the Belief Functions Framework
نویسندگان
چکیده
The problem of deriving a binary relation over alternatives based on paired comparisons is studied. The problem is tackled in the framework of belief functions, which is well-suited to model and manipulate partial and uncertain information. Starting from the work of Tritchler and Lockwood [8], the paper proposes a general model of mass allocation and combination, and shows how to practically derive a complete or a partial ranking of the alternatives. A small example is provided as an illustration.
منابع مشابه
Partial Ranking by Incomplete Pairwise Comparisons Using Preference Subsets
In multi-criteria decision making the decision maker need to assign weights to criteria for evaluation of alternatives, but decision makers usually find it difficult to assign precise weights to several criteria. On the other hand, decision makers may readily provide a number of preferences regarding the relative importance between two disjoint subsets of criteria. We extend a procedure by L. V...
متن کاملThe separation, and separation-deviation methodology for group decision making and aggregate Ranking
In a generic group decision scenario, the decision makers review alternatives and then provide their own individual ranking. The aggregate ranking problem is to obtain a ranking that is fair and representative of the individual rankings. We argue here that using cardinal pairwise comparisons provides several advantages over score-wise models. The aggregate group ranking problem is then formaliz...
متن کاملThe Separation, and Separation-Deviation Methodology
In a generic group decision scenario, the decision makers review alternatives and then provide their own individual ranking. The aggregate ranking problem is to obtain a ranking that is fair and representative of the individual rankings. We argue here that using cardinal pairwise comparisons provides several advantages over scorewise models. The aggregate group ranking problem is then formalize...
متن کاملActive Ranking using Pairwise Comparisons
This paper examines the problem of ranking a collection of objects using pairwise comparisons (rankings of two objects). In general, the ranking of n objects can be identified by standard sorting methods using n log2 n pairwise comparisons. We are interested in natural situations in which relationships among the objects may allow for ranking using far fewer pairwise comparisons. Specifically, w...
متن کاملRanking from Pairwise Comparisons: The Role of the Pairwise Preference Matrix
Ranking a set of items given preferences among them is a fundamental problem that arises naturally in several real world situations such as ranking candidates in elections, movies, sports teams, documents in response to a query to name a few. In each of these situations, the preference data among the items to be ranked may be available in different forms: as pairwise comparisons, partial orderi...
متن کامل